Recursive Smooth Ambiguity Preferences1

نویسندگان

  • Peter Klibanoff
  • Massimo Marinacci
چکیده

This paper axiomatizes an intertemporal version of the Smooth Ambiguity decision model developed in Klibanoff, Marinacci, and Mukerji (2005). A key feature of the model is that it achieves a separation between ambiguity, identified as a characteristic of the decision maker’s subjective beliefs, and ambiguity attitude, a characteristic of the decision maker’s tastes. In applications one may thus specify/vary these two characteristics independent of each other, thereby facilitating richer comparative statics and modeling flexibility than possible under other models which accomodate ambiguity sensitive preferences. Another key feature is that the preferences are dynamically consistent and have a recursive representation. Therefore techniques of dynamic programming can be applied when using this model. JEL Classification Numbers: D800, D810.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intertemporal substitution and recursive smooth ambiguity preferences

In this paper, we establish an axiomatically founded generalized recursive smooth ambiguity model that allows for a separation among intertemporal substitution, risk aversion, and ambiguity aversion. We axiomatize this model using two approaches: the second-order act approach à la Klibanoff et al. (2005) and the twostage randomization approach à la Seo (2009). We characterize risk attitude and ...

متن کامل

Intertemporal Substitution and Recursive Smooth Ambiguity Preferences ∗ Takashi Hayashi

In this paper, we establish an axiomatically founded generalized recursive smooth ambiguity model that allows for a separation among intertemporal substitution, risk aversion, and ambiguity aversion. We axiomatize this model using two approaches: the second-order act approach à la Klibanoff, Marinacci, and Mukerji (2005) and the two-stage randomization approach à la Seo (2009). We characterize ...

متن کامل

Recursive smooth ambiguity preferences

Introduction Propose and provide foundations for a preference model set in an explicitly dynamic framework with uncertainty where: DM is sensitive to ambiguity ambiguity attitude is separated from ambiguity ‡exibility in ambiguity attitude and in scope of ambiguity preferences are dynamically consistent discounted expected utility is a special case beliefs are updated over time

متن کامل

Robustness and ambiguity in continuous time

We use statistical detection theory in a continuous-time environment to provide a new perspective on calibrating a concern about robustness or an aversion to ambiguity. A decision maker repeatedly confronts uncertainty about state transition dynamics and a prior distribution over unobserved states or parameters. Two continuous-time formulations are counterparts of two discrete-time recursive sp...

متن کامل

Recursive Ambiguity and Machina's Examples

Machina (2009, 2012) lists a number of situations where standard models of ambiguity aversion are unable to capture plausible features of ambiguity attitudes. Most of these problems arise in choice over prospects involving three or more outcomes. We show that the recursive non-expected utility model of Segal (1987) is rich enough to accommodate all these situations. JEL Classification number: D81

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006